Path - connect iv i ty in local tournaments 1
نویسنده
چکیده
A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancyclic local tournaments, respectively. Moreover, these also extend the corresponding results in Tian et al. (1982) and Zhang (1982) for tournaments.
منابع مشابه
On the cycle structure of in-tournaments
An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. Therefore, in-tournaments are a generalization of local tournaments where, for every vertex, the set of inneighbors as well as the set of out-neighbors induce a tournament. While local tournaments have been intensively studied very little is known about in-tournaments. It is the purpose of ...
متن کاملLongest paths through an arc in strongly connected in-tournaments
An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. Recently, we have shown that every arc of a strongly connected tournament of order n is contained in a directed path of order r(n + 3)/21. This is no longer valid for strongly connected in-tournaments, because there exist examples containing an arc with the property that the longest directe...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کاملEVIDENCE FOR A FUNDAMENTAL RELATIONSItlP BETWEEN HUMORAL AND CELL-MEDIATED I]~M-UNITY
In the preceding paper (1) some chemical, antigenic, and biological propert ies of a series of ace toace ty la ted derivat ives of Salmonella adelaide flagellin were described. Several chemical and antigenic tests revealed tha t as flagellin was ace toace ty la ted to increasing extents there was a s teady decline in the affinity of the molecule for anti-flagellin antibodies. This loss in antig...
متن کاملConnectivity of local tournaments
For a local tournament D with minimum out-degree δ, minimum indegree δ− and irregularity ig(D), we give a lower bound on the connectivity of D, namely κ(D) ≥ (2 ·max{δ+, δ−}+ 1− ig(D))/3 if there exists a minimum separating set S such that D − S i is a tournament, and κ(D) ≥ (2 ·max{δ+, δ−}+ 2|δ+ − δ−|+ 1− 2ig(D))/3 otherwise. This generalizes a result on tournaments presented by C. Thomassen [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002